Nilpotent Adjacency Matrices and Random Graphs

While powers of the adjacency matrix of a finite graph reveal information about walks on the graph, they fail to distinguish closed walks from cycles. Using elements of an appropriate commutative, nilpotentgenerated algebra, a “new” adjacency matrix can be associated with a random graph on n vertices and |E| edges of nonzero probability. Letting Xk denote the number of k-cycles occurring in a random graph, this algebra together with a probability mapping allow E(Xk) to be recovered in terms of tr A. Higher moments of Xk can also be computed, and conditions are given for the existence of higher moments in growing sequences of random graphs by considering infinite-dimensional algebras. The algebras used can be embedded in algebras of fermion creation and annihilation operators, establishing connections with quantum computing and quantum probability theory. In the framework of quantum probability, the nilpotent adjacency matrix of a finite graph is a quantum random variable whose m moment corresponds to the m-cycles contained in the graph. AMS subject classification: 05C38, 05C80, 60B99, 81P68